Prefix–suffix square reduction

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Optimal Dimension Reduction in Least-Square System Identification

© On Optimal Dimension Reduction in Least-Square System Identification

متن کامل

Optimum Complexity Reduction of Minimum Mean Square ErrorDS - CDMA

|The near-far problem can be the capacity limiting factor for a direct-sequence code division multiple access (DS-CDMA) communication systems. The \classical" near-far resistant receivers are multiuser detectors with rather high complexity requirements. In order to reduce the complexity, the class of minimum mean square error (MMSE) receivers was recently proposed. These receivers typically use...

متن کامل

Bounding the Sum of Square Roots via Lattice Reduction

Let k and n be positive integers. DefineR(n, k) to be the minimum positive value of |ei √ s1 + e2 √ s2 + · · ·+ ek √ sk − t| , where s1, s2, · · · , sk are positive integers no larger than n, t is an integer and ei ∈ {1, 0,−1} for all 1 ≤ i ≤ k. It is important in computational geometry to determine a good lower and upper bound of R(n, k). In this paper we show that this problem is closely rela...

متن کامل

order reduction by minimizing integral square error and h∞ norm of error

in this paper, a new alternative method for order reduction of high order systems is presented based on optimization of multi objective fitness function by using harmony search algorithm. at first, step response of full order system is obtained as a vector, then, a suitable fixed structure considered for model order reduction which order of original system is bigger than fixed structure model. ...

متن کامل

Roots of Square: Cryptanalysis of Double-Layer Square and Square+

Square is a multivariate quadratic encryption scheme proposed in 2009. It is a specialization of Hidden Field Equations by using only odd characteristic elds and also X as its central map. In addition, it uses embedding to reduce the number of variables in the public key. However, the system was broken at Asiacrypt 2009 using a di erential attack. At PQCrypto 2010 Clough and Ding proposed two n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2017

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2016.12.005